A proof of Przytycki's conjecture on n-relator 3-manifolds
نویسندگان
چکیده
منابع مشابه
On the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture
The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...
متن کاملSplines on Riemannian Manifolds and a Proof of a Conjecture by Wahba
This paper extends spline methods to compact Riemannian manifolds in an rkhs setting. The approach is to use the mathematical framework of rkhs, along with integrating spectral geometry associated with compact Riemannian manifolds. This combination aarmatively answers a conjecture made by Wahba (1981) that spline interpolation and smoothing available for the 2{sphere can be generalized to compa...
متن کامل3 Proof of Deninger’s conjecture 15
1. In this paper I compute explicitly the regulator map on K4(X) for an arbitrary curve X over a number field. Using this and Beilinson’s theorem about regulators for modular curves ([B2]) I prove a formula expressing the value of the L-function L(E, s) of a modular elliptic curve E over Q at s = 3 by the double Eisenstein-Kronecker series. It was conjectured by C. Deninger [D1]. 2. Generalized...
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملProof of a conjecture on monomial graphs
Let e be a positive integer, p be an odd prime, q = p, and Fq be the finite field of q elements. Let f, g ∈ Fq[X,Y ]. The graph G = Gq(f, g) is a bipartite graph with vertex partitions P = F3q and L = F 3 q, and edges defined as follows: a vertex (p) = (p1, p2, p3) ∈ P is adjacent to a vertex [l] = [l1, l2, l3] ∈ L if and only if p2 + l2 = f(p1, l1) and p3 + l3 = g(p1, l1). Motivated by some qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology
سال: 1995
ISSN: 0040-9383
DOI: 10.1016/0040-9383(95)93238-3